Each maximal planar graph with exactly two separating triangles is Hamiltonian
نویسندگان
چکیده
منابع مشابه
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian
A graph is hamiltonian if it has a hamiltonian cycle. It is well-known that Tutte proved that any 4connected planar graph is hamiltonian. It is also well-known that the problem of determining whether a 3-connected planar graph is hamiltonian is NP-complete. In particular, Chvátal and Wigderson had independently shown that the problem of determining whether a maximal planar graph is hamiltonian ...
متن کاملvertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملAn efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph
This paper describes an efficient algorithm to find a Hamiltonian circuit in an arbitrary 4-connected maximal planar graph. The algorithm is based on our simlplified version of Whitney's proof of his theorem: every 4-connected maximal planar graph has a Hamiltonian circuit.
متن کاملOn the number of hamiltonian cycles in triangulations with few separating triangles
In 1979 Hakimi, Schmeichel and Thomassen proved that in a triangulation with n vertices and no “separating triangles” – that is: no cycle of length 3 such that there are vertices inside as well as outside of the cycle – there are at least n/(log2 n) different hamiltonian cycles. We introduce a new abstract counting technique for hamiltonian cycles in general graphs. This technique is based on a...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2007
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.03.018